Embedding the Hypercube into the 3-Dimension Mesh
نویسندگان
چکیده
A constant time and space algorithm for embedding the hypercube architecture into the 3-dimension mesh (3Dmesh) is presented. This enables the cubei operation to be performed on the embedded hypercube machine where the interprocessor communication function cubei is defined on the embedded hypercube's PEs as cubei (bn−1LbiLb0 ) = bn−1LbiLb0 and bi is the binary complement of bi .
منابع مشابه
Embedding complete ternary trees into hypercubes
We inductively describe an embedding of a complete ternary tree Th of height h into a hypercube Q of dimension at most d(1.6)he + 1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Th into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Th into its optimal hypercube...
متن کاملSmall congestion embedding of graphs into hypercubes
We consider the problem of embedding graphs into hypercubes with minimal congestion. Kim and Lai showed that for a given N-vertex graph G and a hypercube it is NP-complete to determine whether G is embeddable in the hypercube with unit congestion, but G can be embedded with unit congestion in a hypercube of dimension 6log N if the maximum degree of a vertex in G is no more than 6log N . Bha...
متن کاملOn Fault-Tolerant Embedding of Meshes and Tori in a Flexible Hypercube with Unbounded Expansion
The Flexible Hypercubes are superior to hypercube in terms of embedding a mesh and torus under faults. Therefore, this paper presented techniques to enhance the novel algorithm for fault-tolerant meshes and tori embedded in Flexible Hypercubes with node failures. The paper demonstrates that O(n 2 -log2m 2 ) faults can be tolerated and the algorithm is optimized mainly for balancing the proce...
متن کاملExecuting Algorithms with Hypercube Topology on Torus Multicomputers
Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...
متن کاملEmbedding Hypercubes onto Rings and Toruses
Many parallel algorithms use hypercubes as the communication topology among processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact tha...
متن کامل